Solution-recovery in `1-norm for non-square linear systems: deterministic conditions and open questions

نویسنده

  • Yin Zhang
چکیده

Consider an over-determined linear system Ax ≈ b and an under-determined linear system By = c. Given b = A x̂+h, under what conditions x̂ will minimize the residual ATx− b in `1-norm (i.e., ‖h‖1 = minx ‖ATx− b‖1)? On the other hand, given c = Bh, under what conditions h will be the minimum `1-norm solution of By = c? These two “solution-recovery” problems have been the focus of a number of recent works. Moreover, these two problems are equivalent under appropriate conditions on the data sets (A, b) and (B, c). In this paper, we give deterministic conditions for these solutionrecoverary problems and raise a few open questuions. Some of the results in this paper are already known or partially known, but our derivations are different and thus may provide different perspectives.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Positive solution of non-square fully Fuzzy linear system of equation in general form using least square method

In this paper, we propose the least-squares method for computing the positive solution of a $mtimes n$ fully fuzzy linear system (FFLS) of equations, where $m > n$, based on Kaffman's arithmetic operations on fuzzy numbers that introduced in [18]. First, we consider all elements of coefficient matrix are non-negative or non-positive. Also, we obtain 1-cut of the fuzzy number vector solution of ...

متن کامل

Local stabilization for a class of nonlinear impulsive switched system with non-vanishing uncertainties under a norm-bounded control input

Stability and stabilization of impulsive switched system have been considered in recent decades, but there are some issues that are not yet fully addressed such as actuator saturation. This paper deals with expo-nential stabilization for a class of nonlinear impulsive switched systems with different types of non-vanishing uncertainties under the norm-bounded control input. Due to the constraine...

متن کامل

RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems

Recently, the worse-case analysis, probabilistic analysis and empirical justification have been employed to address the fundamental question: When does l1-minimization find the sparsest solution to an underdetermined linear system? In this paper, a deterministic analysis, rooted in the classic linear programming theory, is carried out to further address this question. We first identify a necess...

متن کامل

Equivalence and Strong Equivalence between Sparsest and Least `1-Norm Nonnegative Solutions of Linear Systems and Their Application

Many practical problems can be formulated as `0-minimization problems with nonnegativity constraints, which seek the sparsest nonnegative solutions to underdetermined linear systems. Recent study indicates that `1-minimization is efficient for solving some classes of `0-minimization problems. From a mathematical point of view, however, the understanding of the relationship between `0and `1-mini...

متن کامل

RSP-Based Analysis for Sparsest and Least ℓ1-Norm Solutions to Underdetermined Linear Systems

Recently, the worse-case analysis, probabilistic analysis and empirical justification have been employed to address the fundamental question: When does l1-minimization find the sparsest solution to an underdetermined linear system? In this paper, a deterministic analysis, rooted in the classic linear programming theory, is carried out to further address this question. We first identify a necess...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005